The PH/PH/1 Multi-threshold Queue
نویسندگان
چکیده
We consider a PH/PH/1 queue in which a threshold policy determines the stage of the system. The arrival and service processes follow a Phase-Type (PH) distribution depending on the stage of the system. Each stage has both a lower and an upper threshold at which the stage of the system changes, and a new stage is chosen according to a prescribed distribution. The PH/PH/1 multi-threshold queue is a QuasiBirth-and-Death process with a tri-diagonal block structured boundary state which we model as a Level Dependent Quasi-Birth-and-Death process. An efficient algorithm is presented to obtain the stationary queue length vectors using Matrix Analytic methods.
منابع مشابه
Busy period analysis of the level dependent PH/PH/1/K queue
In this paper, we study the transient behavior of a level dependent PH/PH/1/K queue during the busy period. We derive in closed-form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. We differentiate between two types of losses: the overflow losses that are due to a full queue and the los...
متن کاملDeparture process analysis of the multi-type MMAP[K]/PH[K]/1 FCFS queue
Departure process analysis of the multi-type MMAP[K]/PH[K]/1 FCFS queue a b s t r a c t The analysis of the departure process of queues is important in several aspects, for instance, it plays a prominent role in the decomposition based analysis of open queueing networks. While there are several results available for the departure process analysis of MAP driven single-class (or, single-type) que...
متن کاملAnalysis of the adaptive MMAP[K]/PH[K]/1 queue: A multi-type queue with adaptive arrivals and general impatience
In this paper we introduce the adaptive MMAP[K] arrival process and analyze the adaptive MMAP[K]/PH[K]/1 queue. In such a queueing system, customers of K different types with Markovian inter-arrival times and possibly correlated customer types, are fed to a single server queue that makes use of r thresholds. Service times are phase-type and depend on the type of customer in service. Type k cust...
متن کاملPH/PH/1 Queueing Models in Mathematica for Performance Evaluation
⎯A review of queueing applications indicates that many researchers have intelligently adapted its theoretical results to develop an easy and effective analytical tool that can be applied to manufacturing system planning. In particular, the PH/PH/1 distribution has been studied extensively for GI/G/1 queue models. We present Mathematica programs that calculate algebraically the probability distr...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کامل